Generalized Catalan numbers and the enumeration of planar embeddings

نویسندگان

  • Jonathan E. Beagley
  • Paul Drube
چکیده

The Raney numbers Rp,r(k) are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns. We give a new combinatorial interpretation for the Raney numbers in terms of planar embeddings of certain collections of trees, a construction that recovers the usual interpretation of the p-Catalan numbers in terms of p-ary trees via the specialization Rp,1(k) = pck. Our technique leads to several combinatorial identities involving the Raney numbers and ordered partitions. We then give additional combinatorial interpretations of specific Raney numbers, including an identification of Rp2,p(k) with oriented trees whose vertices satisfy the “source-sink property.” We close with comments applying these results to the enumeration of connected (non-elliptic) A2 webs that lack an internal cycle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of non-crossing pairings on bit strings

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1101 . . . 1r0r , we generalize classical problems from the theory of Catalan structures. In particular, it is very difficult to find useful explicit formulas for the enumeration function φ(n1, m1, . . . , nr, mr), which count...

متن کامل

Cuntz-krieger Algebras and a Generalization of Catalan Numbers

We first observe that the relations of the canonical generating isometries of the Cuntz algebra ON are naturally related to the N-colored Catalan numbers. For a directed graph G, we generalize the Catalan numbers by using the canonical generating partial isometries of the Cuntz-Krieger algebra O AG for the transition matrix A of G. The generalized Catalan numbers cGn , n = 0, 1, 2, . . . enumer...

متن کامل

A classification of plane and planar 2-trees

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e. a classification of their structures according to their stabilizers. There result explicit formulas in terms of Catalan numbers for their associated generating seri...

متن کامل

A classi cation of plane and planar 2 - trees 1

We present new functional equations for the species of plane and of planar in the sense of Harary and Palmer, 1973 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e.a classiication of their structures according to their stabilizers. Therein result explicit formulas in terms of Catalan numbers for their associated generating series...

متن کامل

A partition of the Catalan numbers and enumeration of genealogical trees

A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers Cn,k of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the Cn,k form a partition of the n-th Catalan numer Cn, that means Cn,1 + Cn,2 + · · ·+ Cn,n = Cn.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2015